package com.cet.algorithm.二叉树.删除二叉搜索树中的节点;

public class TreeNode {
    int val;
  	TreeNode left;
  	TreeNode right;
  	TreeNode() {}
  	TreeNode(int val) { this.val = val; }
  	TreeNode(int val, TreeNode left, TreeNode right) {
    		this.val = val;
    		this.left = left;
    		this.right = right;
  	}

	@Override
	public String toString() {
		return "TreeNode{" +
			"val=" + val +
			", left=" + left +
			", right=" + right +
			'}';
	}
}
